On Generators of Random Quasigroup Problems
نویسنده
چکیده
Random problems are a good source of test suites for comparing quality of constraint satisfaction techniques. Quasigroup problems are representative of structured random problems that are closer to real-life problems. In this paper, we study generators for Quasigroup Completion Problem (QCP) and Quasigroups with Holes (QWH). We propose an improvement of the generator for QCP that produces a larger number of consistent problems by using propagation through the all-different constraint. We also re-formulate the algorithm for generating QWH.
منابع مشابه
On Quasigroup Pseudo Random Sequence Generators
Abstract. Pseudo random sequence generators (PRSG) produce sequences of elements that imitate natural random behavior. They have extensive use in (1) scientific experiments as input sequences for different kinds of simulators, (2) cryptography for preparation of keys and establishing communication and (3) authentication for preparation of identification numbers, smart cards, serial numbers, etc...
متن کاملQuasigroup String Processing
Given a nite setA we consider quasigroup operations n on A and we use them to de ne transformations E n D n A A where A is the set of all nite strings with members from A We show that the mappings E n and D n have several useful properties suitable for many purposes in cryptography coding theory de ning and improving pseudo random generators
متن کاملUnbiased Random Sequences from Quasigroup String Transformations
The need of true random number generators for many purposes (ranging from applications in cryptography and stochastic simulation, to search heuristics and game playing) is increasing every day. Many sources of randomness possess the property of stationarity. However, while a biased die may be a good source of entropy, many applications require input in the form of unbiased bits, rather than bia...
متن کاملBad and Good Ways of Post-processing Biased Physical Random Numbers
Algorithmic post-processing is used to overcome statistical deficiencies of physical random number generators. We show that the quasigroup based approach for post-processing random numbers described in [MGK05] is ineffective and very easy to attack. We also suggest new algorithms which extract considerably more entropy from their input than the known algorithms with an upper bound for the numbe...
متن کاملDesign of low power random number generators for quantum-dot cellular automata
Quantum-dot cellular automata (QCA) are a promising nanotechnology to implement digital circuits at the nanoscale. Devices based on QCA have the advantages of faster speed, lower power consumption, and greatly reduced sizes. In this paper, we are presented the circuits, which generate random numbers in QCA. Random numbers have many uses in science, art, statistics, cryptography, gaming, gambli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005